Mixed Graph Colorings: A Historical Review
نویسندگان
چکیده
منابع مشابه
Curvature from Graph Colorings
Given a finite simple graphG = (V,E) with chromatic number c and chromatic polynomial C(x). Every vertex graph coloring f of G defines an index if (x) satisfying the Poincaré-Hopf theorem [17] ∑ x if (x) = χ(G). As a variant to the index expectation result [19] we prove that E[if (x)] is equal to curvature K(x) satisfying Gauss-Bonnet ∑ xK(x) = χ(G) [16], where the expectation is the average ov...
متن کاملReconfiguring Graph Colorings
Graph coloring has been studied for a long time and continues to receive interest within the research community [43]. It has applications in scheduling [46], timetables, and compiler register allocation [45]. The most popular variant of graph coloring, k-coloring, can be thought of as an assignment of k colors to the vertices of a graph such that adjacent vertices are assigned different colors....
متن کاملAcyclic Colorings of Graph Subdivisions
An acyclic coloring of a graph G is a coloring of the vertices of G, where no two adjacent vertices of G receive the same color and no cycle of G is bichromatic. An acyclic k-coloring of G is an acyclic coloring of G using at most k colors. In this paper we prove that any triangulated plane graph G with n vertices has a subdivision that is acyclically 4-colorable, where the number of division v...
متن کاملCounting Colorings of a Regular Graph
At most how many (proper) q-colorings does a regular graph admit? Galvin and Tetali conjectured that among all n-vertex, d-regular graphs with 2d|n, none admits more q-colorings than the disjoint union of n/2d copies of the complete bipartite graph Kd,d. In this note we give asymptotic evidence for this conjecture, showing that the number of proper q-colorings admitted by an n-vertex, d-regular...
متن کاملEven edge colorings of a graph
It is shown that the minimum number of colors needed to paint the edges of a graph G so that in every cycle of G there is a nonzero even number of edges of at least one color is rlog,X(G)l. For a simple graph G, let E(G) denote the minimum number 1 for which there exists a partition of E(G) into 1 subsets Ej, 1 d id 1, satisfying for any cycle Z of G, 0 < [E(Z) n Eil= 0 (mod 2) for at least one...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2020
ISSN: 2227-7390
DOI: 10.3390/math8030385